Fast and Flexible ADMM Algorithms for Trend Filtering
نویسندگان
چکیده
منابع مشابه
Fast and Flexible ADMM Algorithms for Trend Filtering
This paper presents a fast and robust algorithm for trend filtering, a recently developed nonparametric regression tool. It has been shown that, for estimating functions whose derivatives are of bounded variation, trend filtering achieves the minimax optimal error rate, while other popular methods like smoothing splines and kernels do not. Standing in the way of a more widespread practical adop...
متن کاملFast Median Filtering Algorithms for Mesh Computers Fast Median Filtering Algorithms for Mesh Computers
Two fast algorithms for median ltering of images using parallel computers having 2-D mesh interconnections are given. Both algorithms assume that an n n image is loaded onto the mesh with one processing element per pixel. One algorithm performs median l-tering over d d neighborhoods in O(d 2) time and works with pixel values in an arbitrarily large range. This algorithm, while theoretically sub...
متن کاملFast median filtering algorithms for mesh computers
Two fast algorithms for median ltering of images using parallel computers having 2-D mesh interconnections are given. Both algorithms assume that an n n image is loaded onto the mesh with one processing element per pixel. One algorithm performs median ltering over d d neighborhoods in O(d 2 ) time and works with pixel values in an arbitrarily large range. This algorithm, while theoretically sub...
متن کاملFast-and-Light Stochastic ADMM
The alternating direction method of multipliers (ADMM) is a powerful optimization solver in machine learning. Recently, stochastic ADMM has been integrated with variance reduction methods for stochastic gradient, leading to SAG-ADMM and SDCA-ADMM that have fast convergence rates and low iteration complexities. However, their space requirements can still be high. In this paper, we propose an int...
متن کاملImplementing Fast and Flexible Parallel Genetic Algorithms
As genetic algorithms (GAs) are used to solve harder problems, it is becoming necessary to use better algorithms and more eecient implementations to reach good solutions fast. This chapter describes the implementation of master-slave and multiple-population parallel GAs. The goal of the chapter is to help others to implement their own parallel codes. To this eeect, the text discusses some of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2016
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2015.1054033